|
When number (generally large number) is represented in a finite alphabet set, and it cannot be represented by just one member of the set, Recursive indexing is used. Recursive indexing itself is a method to write the successive differences of the number after extracting the maximum value of the alphabet set from the number, and continuing recursively till the difference falls in the range of the set. Recursive indexing with a 2-letter alphabet is called unary code. ==Encoding== To encode a number ''N'', keep reducing the maximum element of this set (''S''max) from ''N'' and output ''S''max for each such difference, stopping when the number lies in the half closed half open range [0 – ''S''max). 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Recursive indexing」の詳細全文を読む スポンサード リンク
|